Summary management in unstructured P2P systems

نویسندگان

  • Rabab Hayek
  • Guillaume Raschia
  • Patrick Valduriez
  • Noureddine Mouaddib
چکیده

In this paper, we propose managing data summaries in unstructured P2P systems. Our summaries are intelligible views with two main virtues. First, they can be directly queried and used to approximately answer a query. Second, as semantic indexes, they support locating relevant nodes based on data content. The performance evaluation of our proposal shows that the cost of query routing is minimized, while incurring a low cost of summary maintenance. RÉSUMÉ. Dans ce travail, nous proposons de maintenir des résumés de données dans les systèmes P2P non structurés. Nos résumés sont des vues intelligibles ayant un double avantage en traitement de requête. Ils peuvent soit répondre d’une manière approximative à une requête, soit guider sa propagation vers les pairs pertinents en se basant sur le contenu des données. L’évaluation de performance de notre proposition a montré que le coût de requêtes est largement réduit, sans induire des côuts élevés de maintenance de résumés.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

P2P Network Trust Management Survey

Peer-to-peer applications (P2P) are no longer limited to home users, and start being accepted in academic and corporate environments. While file sharing and instant messaging applications are the most traditional examples, they are no longer the only ones benefiting from the potential advantages of P2P networks. For example, network file storage, data transmission, distributed computing, and co...

متن کامل

Schema-Assisted XML Querying in Unstructured P2P Systems

While XML emerges as the de-facto standard for contents available on the Web, centralized approaches for searching the available information is deemed inappropriate at Web scale. Unstructured peer-to-peer (P2P) systems appear as a promising alternative to delve with scalability limitations, hence efficient querying of data stored in XML databases that reside on peers becomes an important challe...

متن کامل

Gossip-Based Reputation Management for Unstructured Peer-to-Peer Networks*

To build an efficient reputation system for peer-to-peer (P2P) networks, we need fast mechanisms to aggregate peer evaluations and to disseminate updated scores to a large number of peer nodes. Unfortunately, unstructured P2P networks are short of secure hashing and fast lookup mechanisms as in structured P2P systems like the DHT-based Chord. In light of this shortcoming, we propose a gossiping...

متن کامل

A Genetic Programming-based trust model for P2P Networks

Abstract— Peer-to-Peer ( P2P ) systems have been the center of attention in recent years due to their advantage . Since each node in such networks can act both as a service provider and as a client , they are subject to different attacks . Therefore it is vital to manage confidence for these vulnerable environments in order to eliminate unsafe peers . This paper investigates the use of genetic ...

متن کامل

Collaborative Load Balancing Scheme for Improving Search Performance in Unstructured P2P Networks

Peer-to-peer structures are becoming more and more popular and an exhilarating new class of groundbreaking, internet-based data management systems. Query load balancing is an important problem for the efficient operation of unstructured P2P networks. The key issue is to identify overloaded peers and reassign their loads to others. This paper proposes a novel mobile agent based two-way load bala...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ingénierie des Systèmes d'Information

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2008